Coupling control variates for Markov chain Monte Carlo
نویسندگان
چکیده
We show that Markov couplings can be used to improve the accuracy of Markov chain Monte Carlo calculations in some situations where the steady-state probability distribution is not explicitly known. The technique generalizes the notion of control variates from classical Monte Carlo integration. We illustrate it using two models of nonequilibrium transport.
منابع مشابه
Multi-process Parallel Antithetic Coupling For Backward and Forward Markov Chain Monte Carlo
Antithetic coupling is a general stratification strategy for reducing Monte Carlo variance without increasing the simulation size. The use of the antithetic principle in the Monte Carlo literature typically employs two strata via antithetic quantile coupling. We demonstrate here that further stratification, obtained by using k > 2 (e.g., k = 3 − 10) antithetically coupled variates, can offer su...
متن کامل2 5 Ju n 20 15 Markov Interacting Importance Samplers
We introduce a new Markov chain Monte Carlo (MCMC) sampler called the Markov Interacting Importance Sampler (MIIS). The MIIS sampler uses conditional importance sampling (IS) approximations to jointly sample the current state of the Markov Chain and estimate conditional expectations, possibly by incorporating a full range of variance reduction techniques. We compute Rao-Blackwellized estimates ...
متن کاملControl Variates for Stochastic Gradient MCMC
It is well known that Markov chain Monte Carlo (MCMC) methods scale poorly with dataset size. We compare the performance of two classes of methods which aim to solve this issue: stochastic gradient MCMC (SGMCMC), and divide and conquer methods. We find an SGMCMC method, stochastic gradient Langevin dynamics (SGLD) to be the most robust in these comparisons. This method makes use of a noisy esti...
متن کاملCoupling from the past with randomized quasi-Monte Carlo
The coupling-from-the-past (CFTP) algorithm of Propp and Wilson, also called perfect sampling, permits one to sample exactly from the stationary distribution of an ergodic Markov chain. By using it n times independently, we obtain an independent sample from that distribution. A more representative sample can be obtained by creating negative dependence between these n replicates; other authors h...
متن کاملNorges Teknisk-naturvitenskapelige Universitet Control Variates for the Metropolis-hastings Algorithm Control Variates for the Metropolis-hastings Algorithm
We propose new control variates for variance reduction in the Metropolis–Hastings algorithm. We use variates that are functions of both the current state of the Markov chain and the proposed new state. This enable us to specify control variates which have known mean values for general target and proposal distributions. We develop the ideas for both the standard Metropolis–Hastings algorithm and...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Comput. Physics
دوره 228 شماره
صفحات -
تاریخ انتشار 2009